A Note on Decoding of Superimposed Codes
نویسندگان
چکیده
A superimposed code with general distance D can be used to construct a non-adaptive pooling design. It can then be used to identify a few unknown positives from a large set of items by associating naturally an outcome vector u. A simple method for decoding the outcome vector u is given whenever there are at most bD−1 2 c errors occuring in the outcome vector u. Moreover, another simple method of detecting whether there is any error occuring in the outcome vector u is also given whenever there are at most D − 1 errors in u. Our method is a generalization of the classical result of W. H. Kautz and R. C. Singleton[Nonadaptive binary superimposed codes, IEEE Trans. Inform. Theory, 10:363-377, 1964].
منابع مشابه
Bounds on the rate of disjunctive codes (in Russian)
A binary code is called a superimposed cover-free $(s,\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets...
متن کاملتجزیه و تحلیل عملکرد کدهای کانولوشنال تعریف شده در میدان حقیقی در کانال فیدینگ و در حضور نویز کوانتیزاسیون
Channel coding is one of the techniques used for suppression of fading and channel noise effects. Most of the researches on channel codes have been focused on the codes which are defined on Galois fields. Since two decades ago, using channel codes defined on Real and Complex fields has been considered for joint sourcechannel coding in multimedia transmission; but most of the works have focused ...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملCollusion-Resistant Fingerprints Based on Real Superimposed Codes
We use random superimposed codes as sequences for collusion-resistant fingerprints. This approach is more suitable in comparison with the use of some other regular sequences (as WBE-sequences) against watermark removal attacks and traitor tracing is done through the sphere decoding algorithm. The performance evaluation of the proposed method is presented and the simulation results show an accep...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Optim.
دوره 7 شماره
صفحات -
تاریخ انتشار 2003